- Polya's theorem
- Макаров: теорема Поля
Универсальный англо-русский словарь. Академик.ру. 2011.
Polya's theorem
Смотреть что такое "Polya's theorem" в других словарях:
Pólya enumeration theorem — Enumeration theorem redirects here. For its labelled counterpart, see Labelled enumeration theorem. The Pólya enumeration theorem (PET), also known as Redfield–Pólya s Theorem, is a theorem in combinatorics, generalizing Burnside s lemma about… … Wikipedia
Fundamental theorem of combinatorial enumeration — The fundamental theorem of combinatorial enumeration is a theorem in combinatorics that solves the enumeration problem of labelled and unlabelled combinatorial classes. The unlabelled case is based on the Pólya enumeration theorem.This theorem is … Wikipedia
George Pólya — (b. December 13, 1887 ndash; d. September 7, 1985, in Hungarian Pólya György ) was a Hungarian mathematician.Life and worksHe was born as Pólya György in Budapest, Hungary, and died in Palo Alto, California, USA. He was a professor of mathematics … Wikipedia
Théorème de Pólya — Il existe beaucoup de théorèmes dits de Pólya. Le plus connu en théorie des nombres semble le suivant[1]: Si une fonction holomorphe sur le plan complexe (autrement dit, une fonction entière) envoie l ensemble des entiers naturels dans l ensemble … Wikipédia en Français
Labelled enumeration theorem — The labelled enumeration theorem is the counterpart of the Pólya enumeration theorem for the labelled case, where we have a set of labelled objects given by an exponential generating function (EGF) g ( z ) which are being distributed into n slots … Wikipedia
Central limit theorem — This figure demonstrates the central limit theorem. The sample means are generated using a random number generator, which draws numbers between 1 and 100 from a uniform probability distribution. It illustrates that increasing sample sizes result… … Wikipedia
Saint-Venant's theorem — In solid mechanics, it is common to analyze the properties of beams with constant cross section. Saint Venant s theorem states that the simply connected cross section with maximal torsional rigidity is a circle. E. Makai, A proof of Saint Venant… … Wikipedia
de Finetti's theorem — In probability theory, de Finetti s theorem explains why exchangeable observations are conditionally independent given some latent variable to which an epistemic probability distribution would then be assigned. It is named in honor of Bruno de… … Wikipedia
List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… … Wikipedia
combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… … Universalium
Characteristic function (probability theory) — The characteristic function of a uniform U(–1,1) random variable. This function is real valued because it corresponds to a random variable that is symmetric around the origin; however in general case characteristic functions may be complex valued … Wikipedia
